TSTP Solution File: HEN002-5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : HEN002-5 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 17:09:27 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : HEN002-5 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 27 17:04:24 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.pPLwnUPEA3/cvc5---1.0.5_29649.smt2
% 0.22/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.pPLwnUPEA3/cvc5---1.0.5_29649.smt2
% 0.22/0.52 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero)))
% 0.22/0.52 (assume a1 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero)))
% 0.22/0.52 (assume a2 (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)))
% 0.22/0.52 (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y))))
% 0.22/0.52 (assume a4 (forall ((X $$unsorted)) (= (tptp.divide X tptp.identity) tptp.zero)))
% 0.22/0.52 (assume a5 (not (= (tptp.divide tptp.zero tptp.a) tptp.zero)))
% 0.22/0.52 (step t1 (cl (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) :rule implies_neg1)
% 0.22/0.52 (anchor :step t2)
% 0.22/0.52 (assume t2.a0 (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))))
% 0.22/0.52 (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) (= tptp.zero (tptp.divide tptp.zero tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.22/0.52 (step t2.t2 (cl (not (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) :rule or :premises (t2.t1))
% 0.22/0.52 (step t2.t3 (cl (= tptp.zero (tptp.divide tptp.zero tptp.a))) :rule resolution :premises (t2.t2 t2.a0))
% 0.22/0.52 (step t2 (cl (not (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) :rule subproof :discharge (t2.a0))
% 0.22/0.52 (step t3 (cl (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) :rule resolution :premises (t1 t2))
% 0.22/0.52 (step t4 (cl (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) (not (= tptp.zero (tptp.divide tptp.zero tptp.a)))) :rule implies_neg2)
% 0.22/0.52 (step t5 (cl (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a)))) :rule resolution :premises (t3 t4))
% 0.22/0.52 (step t6 (cl (=> (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (= tptp.zero (tptp.divide tptp.zero tptp.a)))) :rule contraction :premises (t5))
% 0.22/0.52 (step t7 (cl (not (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) (= tptp.zero (tptp.divide tptp.zero tptp.a))) :rule implies :premises (t6))
% 0.22/0.52 (step t8 (cl (= tptp.zero (tptp.divide tptp.zero tptp.a)) (not (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))))) :rule reordering :premises (t7))
% 0.22/0.52 (step t9 (cl (not (= tptp.zero (tptp.divide tptp.zero tptp.a)))) :rule not_symm :premises (a5))
% 0.22/0.52 (step t10 (cl (not (= (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)) (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))))) (not (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero))) (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) :rule equiv_pos2)
% 0.22/0.52 (anchor :step t11 :args ((X $$unsorted) (:= X X)))
% 0.22/0.52 (step t11.t1 (cl (= X X)) :rule refl)
% 0.22/0.52 (step t11.t2 (cl (= (= (tptp.divide tptp.zero X) tptp.zero) (= tptp.zero (tptp.divide tptp.zero X)))) :rule all_simplify)
% 0.22/0.52 (step t11 (cl (= (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)) (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))))) :rule bind)
% 0.22/0.52 (step t12 (cl (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X)))) :rule resolution :premises (t10 t11 a2))
% 0.22/0.52 (step t13 (cl) :rule resolution :premises (t8 t9 t12))
% 0.22/0.52
% 0.22/0.52 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.pPLwnUPEA3/cvc5---1.0.5_29649.smt2
% 0.22/0.53 % cvc5---1.0.5 exiting
% 0.22/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------