TSTP Solution File: GRP017-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP017-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n027.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:18 EDT 2024
% Result : Unsatisfiable 1.22s 1.42s
% Output : Proof 1.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : GRP017-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 26 18:09:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 %----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...
% 1.22/1.42 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.MGnCYhTen8/cvc5---1.0.5_11521.smt2
% 1.22/1.42 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.MGnCYhTen8/cvc5---1.0.5_11521.smt2
% 1.22/1.42 (assume a0 (forall ((X $$unsorted)) (tptp.product tptp.identity X X)))
% 1.22/1.42 (assume a1 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 1.22/1.42 (assume a2 (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)))
% 1.22/1.42 (assume a3 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 1.22/1.42 (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 1.22/1.42 (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))))
% 1.22/1.42 (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))))
% 1.22/1.42 (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))))
% 1.22/1.42 (assume a8 (tptp.product tptp.a tptp.b tptp.identity))
% 1.22/1.42 (assume a9 (tptp.product tptp.b tptp.a tptp.identity))
% 1.22/1.42 (assume a10 (tptp.product tptp.a tptp.c tptp.identity))
% 1.22/1.42 (assume a11 (tptp.product tptp.c tptp.a tptp.identity))
% 1.22/1.42 (assume a12 (not (= tptp.b tptp.c)))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) (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)
% 1.22/1.42 (anchor :step t2)
% 1.22/1.42 (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))))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule forall_inst :args ((:= X tptp.identity) (:= Y tptp.c) (:= Z tptp.b) (:= W tptp.c)))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) :rule or :premises (t2.t1))
% 1.22/1.42 (step t2.t3 (cl (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) :rule resolution :premises (t2.t2 t2.a0))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) :rule subproof :discharge (t2.a0))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) :rule resolution :premises (t1 t2))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) (not (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule implies_neg2)
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) (=> (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule resolution :premises (t3 t4))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule contraction :premises (t5))
% 1.22/1.42 (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.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) :rule implies :premises (t6))
% 1.22/1.42 (step t8 (cl (not (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c))) (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)) :rule or_pos)
% 1.22/1.42 (step t9 (cl (= tptp.b tptp.c) (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (not (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule reordering :premises (t8))
% 1.22/1.42 (step t10 (cl (not (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)) :rule or_pos)
% 1.22/1.42 (step t11 (cl (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b) (not (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)))) :rule reordering :premises (t10))
% 1.22/1.42 (step t12 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b)) (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) :rule implies_neg1)
% 1.22/1.42 (anchor :step t13)
% 1.22/1.42 (assume t13.a0 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 1.22/1.42 (step t13.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.b tptp.identity tptp.b))) :rule forall_inst :args ((:= X tptp.b)))
% 1.22/1.42 (step t13.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.b tptp.identity tptp.b)) :rule or :premises (t13.t1))
% 1.22/1.42 (step t13.t3 (cl (tptp.product tptp.b tptp.identity tptp.b)) :rule resolution :premises (t13.t2 t13.a0))
% 1.22/1.42 (step t13 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.b tptp.identity tptp.b)) :rule subproof :discharge (t13.a0))
% 1.22/1.42 (step t14 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.b tptp.identity tptp.b)) :rule resolution :premises (t12 t13))
% 1.22/1.42 (step t15 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b)) (not (tptp.product tptp.b tptp.identity tptp.b))) :rule implies_neg2)
% 1.22/1.42 (step t16 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b)) (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b))) :rule resolution :premises (t14 t15))
% 1.22/1.42 (step t17 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.b tptp.identity tptp.b))) :rule contraction :premises (t16))
% 1.22/1.42 (step t18 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.b tptp.identity tptp.b)) :rule implies :premises (t17))
% 1.22/1.42 (step t19 (cl (tptp.product tptp.b tptp.identity tptp.b)) :rule resolution :premises (t18 a1))
% 1.22/1.42 (step t20 (cl (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) (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)))) :rule implies_neg1)
% 1.22/1.42 (anchor :step t21)
% 1.22/1.42 (assume t21.a0 (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))))
% 1.22/1.42 (step t21.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)))) :rule forall_inst :args ((:= X tptp.b) (:= Y tptp.a) (:= U tptp.identity) (:= Z tptp.c) (:= V tptp.identity) (:= W tptp.b)))
% 1.22/1.42 (step t21.t2 (cl (not (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)))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule or :premises (t21.t1))
% 1.22/1.42 (step t21.t3 (cl (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule resolution :premises (t21.t2 t21.a0))
% 1.22/1.42 (step t21 (cl (not (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)))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule subproof :discharge (t21.a0))
% 1.22/1.42 (step t22 (cl (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule resolution :premises (t20 t21))
% 1.22/1.42 (step t23 (cl (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) (not (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)))) :rule implies_neg2)
% 1.22/1.42 (step t24 (cl (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)))) :rule resolution :premises (t22 t23))
% 1.22/1.42 (step t25 (cl (=> (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))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b)))) :rule contraction :premises (t24))
% 1.22/1.42 (step t26 (cl (not (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)))) (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule implies :premises (t25))
% 1.22/1.42 (step t27 (cl (or (not (tptp.product tptp.b tptp.a tptp.identity)) (not (tptp.product tptp.a tptp.c tptp.identity)) (not (tptp.product tptp.b tptp.identity tptp.b)) (tptp.product tptp.identity tptp.c tptp.b))) :rule resolution :premises (t26 a7))
% 1.22/1.42 (step t28 (cl (tptp.product tptp.identity tptp.c tptp.b)) :rule resolution :premises (t11 a9 a10 t19 t27))
% 1.22/1.42 (step t29 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c)) (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) :rule implies_neg1)
% 1.22/1.42 (anchor :step t30)
% 1.22/1.42 (assume t30.a0 (forall ((X $$unsorted)) (tptp.product tptp.identity X X)))
% 1.22/1.42 (step t30.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity tptp.c tptp.c))) :rule forall_inst :args ((:= X tptp.c)))
% 1.22/1.42 (step t30.t2 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity tptp.c tptp.c)) :rule or :premises (t30.t1))
% 1.22/1.42 (step t30.t3 (cl (tptp.product tptp.identity tptp.c tptp.c)) :rule resolution :premises (t30.t2 t30.a0))
% 1.22/1.42 (step t30 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity tptp.c tptp.c)) :rule subproof :discharge (t30.a0))
% 1.22/1.42 (step t31 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c)) (tptp.product tptp.identity tptp.c tptp.c)) :rule resolution :premises (t29 t30))
% 1.22/1.42 (step t32 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c)) (not (tptp.product tptp.identity tptp.c tptp.c))) :rule implies_neg2)
% 1.22/1.42 (step t33 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c)) (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c))) :rule resolution :premises (t31 t32))
% 1.22/1.42 (step t34 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity tptp.c tptp.c))) :rule contraction :premises (t33))
% 1.22/1.42 (step t35 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity tptp.c tptp.c)) :rule implies :premises (t34))
% 1.22/1.42 (step t36 (cl (tptp.product tptp.identity tptp.c tptp.c)) :rule resolution :premises (t35 a0))
% 1.22/1.42 (step t37 (cl (not (or (not (tptp.product tptp.identity tptp.c tptp.b)) (not (tptp.product tptp.identity tptp.c tptp.c)) (= tptp.b tptp.c)))) :rule resolution :premises (t9 a12 t28 t36))
% 1.22/1.42 (step t38 (cl) :rule resolution :premises (t7 t37 a5))
% 1.22/1.42
% 1.22/1.42 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.MGnCYhTen8/cvc5---1.0.5_11521.smt2
% 1.22/1.43 % cvc5---1.0.5 exiting
% 1.22/1.43 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------