TSTP Solution File: RNG006-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : RNG006-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n011.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:40:59 EDT 2024
% Result : Unsatisfiable 0.35s 0.54s
% Output : Proof 0.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG006-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 25 21:11:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.35/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.RBSeflXVb8/cvc5---1.0.5_24341.smt2
% 0.35/0.54 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.RBSeflXVb8/cvc5---1.0.5_24341.smt2
% 0.35/0.55 (assume a0 (forall ((X $$unsorted)) (tptp.sum tptp.additive_identity X X)))
% 0.35/0.55 (assume a1 (forall ((X $$unsorted)) (tptp.sum X tptp.additive_identity X)))
% 0.35/0.55 (assume a2 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 0.35/0.55 (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.sum X Y (tptp.add X Y))))
% 0.35/0.55 (assume a4 (forall ((X $$unsorted)) (tptp.sum (tptp.additive_inverse X) X tptp.additive_identity)))
% 0.35/0.55 (assume a5 (forall ((X $$unsorted)) (tptp.sum X (tptp.additive_inverse X) tptp.additive_identity)))
% 0.35/0.55 (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum U Z W)) (tptp.sum X V W))))
% 0.35/0.55 (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum Y Z V)) (not (tptp.sum X V W)) (tptp.sum U Z W))))
% 0.35/0.55 (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))))
% 0.35/0.55 (assume a9 (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.35/0.55 (assume a10 (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.35/0.55 (assume a11 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.product X V3 V4)) (tptp.sum V1 V2 V4))))
% 0.35/0.55 (assume a12 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))))
% 0.35/0.55 (assume a13 (forall ((Y $$unsorted) (X $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product Y X V1)) (not (tptp.product Z X V2)) (not (tptp.sum Y Z V3)) (not (tptp.product V3 X V4)) (tptp.sum V1 V2 V4))))
% 0.35/0.55 (assume a14 (forall ((Y $$unsorted) (X $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product Y X V1)) (not (tptp.product Z X V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product V3 X V4))))
% 0.35/0.55 (assume a15 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.sum X Y U)) (not (tptp.sum X Y V)) (= U V))))
% 0.35/0.55 (assume a16 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (V $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product X Y V)) (= U V))))
% 0.35/0.55 (assume a17 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))))
% 0.35/0.55 (assume a18 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product (tptp.additive_inverse A) B (tptp.additive_inverse C)))))
% 0.35/0.55 (assume a19 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product (tptp.additive_inverse A) (tptp.additive_inverse B) C))))
% 0.35/0.55 (assume a20 (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic))
% 0.35/0.55 (assume a21 (tptp.product tptp.a tptp.b tptp.aPb))
% 0.35/0.55 (assume a22 (tptp.product tptp.a tptp.c tptp.aPc))
% 0.35/0.55 (assume a23 (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc))
% 0.35/0.55 (assume a24 (not (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))
% 0.35/0.55 (step t1 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C))))) :rule implies_neg1)
% 0.35/0.55 (anchor :step t2)
% 0.35/0.55 (assume t2.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))))
% 0.35/0.55 (step t2.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C))))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule forall_inst :args ((:= A tptp.a) (:= B tptp.c) (:= C tptp.aPc)))
% 0.35/0.55 (step t2.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C))))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule or :premises (t2.t1))
% 0.35/0.55 (step t2.t3 (cl (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.35/0.55 (step t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C))))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule subproof :discharge (t2.a0))
% 0.35/0.55 (step t3 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule resolution :premises (t1 t2))
% 0.35/0.55 (step t4 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) (not (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule implies_neg2)
% 0.35/0.55 (step t5 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule resolution :premises (t3 t4))
% 0.35/0.55 (step t6 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C)))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule contraction :premises (t5))
% 0.35/0.55 (step t7 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.product A B C)) (tptp.product A (tptp.additive_inverse B) (tptp.additive_inverse C))))) (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule implies :premises (t6))
% 0.35/0.55 (step t8 (cl (not (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) :rule or_pos)
% 0.35/0.55 (step t9 (cl (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)) (not (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule reordering :premises (t8))
% 0.35/0.55 (step t10 (cl (not (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)) :rule or_pos)
% 0.35/0.55 (step t11 (cl (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))) :rule reordering :premises (t10))
% 0.35/0.55 (step t12 (cl (not (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) :rule or_pos)
% 0.35/0.55 (step t13 (cl (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic) (not (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)))) :rule reordering :premises (t12))
% 0.35/0.55 (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) :rule implies_neg1)
% 0.35/0.55 (anchor :step t15)
% 0.35/0.55 (assume t15.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))))
% 0.35/0.55 (step t15.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)))) :rule forall_inst :args ((:= X tptp.b) (:= Y (tptp.additive_inverse tptp.c)) (:= Z tptp.bS_Ic)))
% 0.35/0.55 (step t15.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule or :premises (t15.t1))
% 0.35/0.55 (step t15.t3 (cl (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule resolution :premises (t15.t2 t15.a0))
% 0.35/0.55 (step t15 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule subproof :discharge (t15.a0))
% 0.35/0.55 (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule resolution :premises (t14 t15))
% 0.35/0.55 (step t17 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) (not (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)))) :rule implies_neg2)
% 0.35/0.55 (step t18 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)))) :rule resolution :premises (t16 t17))
% 0.35/0.55 (step t19 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)))) :rule contraction :premises (t18))
% 0.35/0.55 (step t20 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule implies :premises (t19))
% 0.35/0.55 (step t21 (cl (or (not (tptp.sum tptp.b (tptp.additive_inverse tptp.c) tptp.bS_Ic)) (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic))) :rule resolution :premises (t20 a8))
% 0.35/0.55 (step t22 (cl (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) :rule resolution :premises (t13 a20 t21))
% 0.35/0.55 (step t23 (cl (not (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) :rule or_pos)
% 0.35/0.55 (step t24 (cl (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc) (not (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)))) :rule reordering :premises (t23))
% 0.35/0.55 (step t25 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) :rule implies_neg1)
% 0.35/0.55 (anchor :step t26)
% 0.35/0.55 (assume t26.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))))
% 0.35/0.55 (step t26.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)))) :rule forall_inst :args ((:= X tptp.aPb) (:= Y (tptp.additive_inverse tptp.aPc)) (:= Z tptp.aPb_S_IaPc)))
% 0.35/0.55 (step t26.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule or :premises (t26.t1))
% 0.35/0.55 (step t26.t3 (cl (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule resolution :premises (t26.t2 t26.a0))
% 0.35/0.55 (step t26 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule subproof :discharge (t26.a0))
% 0.35/0.55 (step t27 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule resolution :premises (t25 t26))
% 0.35/0.55 (step t28 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) (not (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)))) :rule implies_neg2)
% 0.35/0.55 (step t29 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)))) :rule resolution :premises (t27 t28))
% 0.35/0.55 (step t30 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)))) :rule contraction :premises (t29))
% 0.35/0.55 (step t31 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.sum X Y Z)) (tptp.sum Y X Z)))) (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule implies :premises (t30))
% 0.35/0.55 (step t32 (cl (or (not (tptp.sum tptp.aPb (tptp.additive_inverse tptp.aPc) tptp.aPb_S_IaPc)) (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc))) :rule resolution :premises (t31 a8))
% 0.35/0.55 (step t33 (cl (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) :rule resolution :premises (t24 a23 t32))
% 0.35/0.55 (step t34 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4)))) :rule implies_neg1)
% 0.35/0.55 (anchor :step t35)
% 0.35/0.55 (assume t35.a0 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))))
% 0.35/0.55 (step t35.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4)))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))) :rule forall_inst :args ((:= X tptp.a) (:= Y (tptp.additive_inverse tptp.c)) (:= V1 (tptp.additive_inverse tptp.aPc)) (:= Z tptp.b) (:= V2 tptp.aPb) (:= V3 tptp.bS_Ic) (:= V4 tptp.aPb_S_IaPc)))
% 0.35/0.55 (step t35.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4)))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule or :premises (t35.t1))
% 0.35/0.55 (step t35.t3 (cl (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule resolution :premises (t35.t2 t35.a0))
% 0.35/0.55 (step t35 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4)))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule subproof :discharge (t35.a0))
% 0.35/0.55 (step t36 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule resolution :premises (t34 t35))
% 0.35/0.55 (step t37 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (not (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))) :rule implies_neg2)
% 0.35/0.55 (step t38 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))) :rule resolution :premises (t36 t37))
% 0.35/0.55 (step t39 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc)))) :rule contraction :premises (t38))
% 0.35/0.55 (step t40 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted)) (or (not (tptp.product X Y V1)) (not (tptp.product X Z V2)) (not (tptp.sum Y Z V3)) (not (tptp.sum V1 V2 V4)) (tptp.product X V3 V4)))) (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule implies :premises (t39))
% 0.35/0.55 (step t41 (cl (or (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))) (not (tptp.product tptp.a tptp.b tptp.aPb)) (not (tptp.sum (tptp.additive_inverse tptp.c) tptp.b tptp.bS_Ic)) (not (tptp.sum (tptp.additive_inverse tptp.aPc) tptp.aPb tptp.aPb_S_IaPc)) (tptp.product tptp.a tptp.bS_Ic tptp.aPb_S_IaPc))) :rule resolution :premises (t40 a12))
% 0.35/0.55 (step t42 (cl (not (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc)))) :rule resolution :premises (t11 a24 a21 t22 t33 t41))
% 0.35/0.55 (step t43 (cl (not (or (not (tptp.product tptp.a tptp.c tptp.aPc)) (tptp.product tptp.a (tptp.additive_inverse tptp.c) (tptp.additive_inverse tptp.aPc))))) :rule resolution :premises (t9 a22 t42))
% 0.35/0.55 (step t44 (cl) :rule resolution :premises (t7 t43 a17))
% 0.35/0.55
% 0.35/0.55 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.RBSeflXVb8/cvc5---1.0.5_24341.smt2
% 0.35/0.55 % cvc5---1.0.5 exiting
% 0.35/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------