TSTP Solution File: GRP021-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP021-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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 16:50:19 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP021-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n005.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 18:15:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.49 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.8aFEtfM3ac/cvc5---1.0.5_26226.smt2
% 0.21/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.8aFEtfM3ac/cvc5---1.0.5_26226.smt2
% 0.21/0.51 (assume a0 (forall ((X $$unsorted)) (tptp.product tptp.identity X X)))
% 0.21/0.51 (assume a1 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 0.21/0.51 (assume a2 (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)))
% 0.21/0.51 (assume a3 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 0.21/0.51 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 0.21/0.51 (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))))
% 0.21/0.51 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))))
% 0.21/0.51 (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))))
% 0.21/0.51 (assume a8 (not (= (tptp.multiply tptp.a (tptp.inverse tptp.a)) tptp.identity)))
% 0.21/0.51 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t2)
% 0.21/0.51 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))))
% 0.21/0.51 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule forall_inst :args ((:= X tptp.a) (:= Y (tptp.inverse tptp.a)) (:= Z tptp.identity) (:= W (tptp.multiply tptp.a (tptp.inverse tptp.a)))))
% 0.21/0.51 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule or :premises (t2.t1))
% 0.21/0.51 (step t2.t3 (cl (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.21/0.51 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule subproof :discharge (t2.a0))
% 0.21/0.51 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule resolution :premises (t1 t2))
% 0.21/0.51 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) (not (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule implies_neg2)
% 0.21/0.51 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule resolution :premises (t3 t4))
% 0.21/0.51 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule contraction :premises (t5))
% 0.21/0.51 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule implies :premises (t6))
% 0.21/0.51 (step t8 (cl (not (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule or_pos)
% 0.21/0.51 (step t9 (cl (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (not (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule reordering :premises (t8))
% 0.21/0.51 (step t10 (cl (not (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule not_symm :premises (a8))
% 0.21/0.51 (step t11 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t12)
% 0.21/0.51 (assume t12.a0 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 0.21/0.51 (step t12.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule forall_inst :args ((:= X tptp.a)))
% 0.21/0.51 (step t12.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule or :premises (t12.t1))
% 0.21/0.51 (step t12.t3 (cl (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t12.t2 t12.a0))
% 0.21/0.51 (step t12 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule subproof :discharge (t12.a0))
% 0.21/0.51 (step t13 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t11 t12))
% 0.21/0.51 (step t14 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule implies_neg2)
% 0.21/0.51 (step t15 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule resolution :premises (t13 t14))
% 0.21/0.51 (step t16 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule contraction :premises (t15))
% 0.21/0.51 (step t17 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule implies :premises (t16))
% 0.21/0.51 (step t18 (cl (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t17 a3))
% 0.21/0.51 (step t19 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) :rule implies_neg1)
% 0.21/0.51 (anchor :step t20)
% 0.21/0.51 (assume t20.a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 0.21/0.51 (step t20.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule forall_inst :args ((:= X tptp.a) (:= Y (tptp.inverse tptp.a))))
% 0.21/0.51 (step t20.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule or :premises (t20.t1))
% 0.21/0.51 (step t20.t3 (cl (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule resolution :premises (t20.t2 t20.a0))
% 0.21/0.51 (step t20 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule subproof :discharge (t20.a0))
% 0.21/0.51 (step t21 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule resolution :premises (t19 t20))
% 0.21/0.51 (step t22 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule implies_neg2)
% 0.21/0.51 (step t23 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule resolution :premises (t21 t22))
% 0.21/0.51 (step t24 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a))))) :rule contraction :premises (t23))
% 0.21/0.51 (step t25 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule implies :premises (t24))
% 0.21/0.51 (step t26 (cl (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) :rule resolution :premises (t25 a4))
% 0.21/0.51 (step t27 (cl (not (or (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) (tptp.multiply tptp.a (tptp.inverse tptp.a)))) (= tptp.identity (tptp.multiply tptp.a (tptp.inverse tptp.a)))))) :rule resolution :premises (t9 t10 t18 t26))
% 0.21/0.51 (step t28 (cl) :rule resolution :premises (t7 t27 a5))
% 0.21/0.51
% 0.21/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.8aFEtfM3ac/cvc5---1.0.5_26226.smt2
% 0.21/0.52 % cvc5---1.0.5 exiting
% 0.21/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------